A Graph Theoretic Approach to Power System Vulnerability Identification

نویسندگان

چکیده

During major power system disturbances, when multiple component outages occur in rapid succession, it becomes crucial to quickly identify the transmission interconnections that have limited transfer capability. Understanding impact of an outage on these critical (called saturated cut-sets) is important for enhancing situational awareness and taking correct actions. This paper proposes a new graph theoretic approach analyzing whether contingency will create cut-set meshed network. A novel feature proposed algorithm lowers solution time significantly making viable real-time operations. It also indicates minimum amount by which through should be reduced so post-contingency saturation does not occur. Robustness enhanced demonstrated using IEEE-118 bus as well 17,000+ model Western Interconnection (WI). Comparisons made with different approaches vulnerability assessment prove utility scheme aiding operations during extreme exigencies.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Transport and Vulnerability in River Deltas: A Graph-Theoretic Approach

Maintaining a sustainable socio-ecological state of a river delta requires delivery of material and energy fluxes to its body and coastal zone in a way that avoids malnourishment that would compromise system integrity. We present a quantitative framework for studying delta topology and transport based on representation of a deltaic system by a rooted directed acyclic graph. Applying results fro...

متن کامل

A module theoretic approach to‎ ‎zero-divisor graph with respect to (first) dual

Let $M$ be an $R$-module and $0 neq fin M^*={rm Hom}(M,R)$. We associate an undirected graph $gf$ to $M$ in which non-zero elements $x$ and $y$ of $M$ are adjacent provided that $xf(y)=0$ or $yf(x)=0$. Weobserve that over a commutative ring $R$, $gf$ is connected anddiam$(gf)leq 3$. Moreover, if $Gamma (M)$ contains a cycle,then $mbox{gr}(gf)leq 4$. Furthermore if $|gf|geq 1$, then$gf$ is finit...

متن کامل

A Graph { Theoretic Approach to ImageDatabase

Feature vectors that are used to represent images exist in a very high dimensional space. Usually, a parametric characterization of the distribution of this space is impossible. It is generally assumed that the features are able to locate visually similar images close in the feature space so that non-parametric approaches, like the k-nearest neighbor search, can be used for retrieval. This pape...

متن کامل

A Graph Theoretic Approach to Software Watermarking

We present a graph theoretic approach for watermarking software in a robust fashion. While watermarking software that are small in size (e.g. a few kilobytes) may be infeasible through this approach, it seems to be a viable scheme for large applications. Our approach works with control/data flow graphs and uses abstractions, approximate k-partitions, and a random walk method to embed the waterm...

متن کامل

A Graph-Theoretic Approach to Steganography

We suggest a graph-theoretic approach to steganography based on the idea of exchanging rather than overwriting pixels. We construct a graph from the cover data and the secret message. Pixels that need to be modified are represented as vertices and possible partners of an exchange are connected by edges. An embedding is constructed by solving the combinatorial problem of calculating a maximum ca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Power Systems

سال: 2021

ISSN: ['0885-8950', '1558-0679']

DOI: https://doi.org/10.1109/tpwrs.2020.3010476